An efficient mean field approach to the set covering problem
نویسندگان
چکیده
منابع مشابه
An Efficient Mean Field Approach to the Set Covering Problem
A mean field feedback artificial neural network algorithm is developed and explored for the set covering problem. A convenient encoding of the inequality constraints is achieved by means of a multilinear penalty function. An approximate energy minimum is obtained by iterating a set of mean field equations, in combination with annealing. The approach is numerically tested against a set of public...
متن کاملAn Eecient Mean Field Approach to the Set Covering Problem
A mean eld feedback artiicial neural network algorithm is developed and explored for the set covering problem. A convenient encoding of the inequality constraints is achieved by means of a multilinear penalty function. An approximate energy minimum is obtained by iterating a set of mean eld equations, in combination with annealing. The approach is numerically tested against a set of publicly av...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملAn Incremental Approach to the Set Covering Problem
The set covering problem is a classical problem in computer science and complexity theory and it serves as a model for many real-world applications especially in the resource allocation area. In an environment where the demands that need to be covered change over time, special methods are needed that adapt to such changes. We have developed an incremental clustering algorithm in order to addres...
متن کاملa local branching approach for the set covering problem
the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2001
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(00)00205-8